Euclidean TSP between two nested convex obstacles
نویسندگان
چکیده
We present a polynomial-time algorithm for a variant of the Euclidean traveling salesman tour where n vertices are on the boundary of a convex polygon P and m vertices form the boundary of a convex polygonal obstacle Q completely contained within P . In the worst case the algorithm needs O(m lg m+ mn) time and O(nm + m) space.
منابع مشابه
Between a Rock and a Hard Place: Euclidean Tsp in the Presence of Polygonal Obstacles
Between a Rock and a Hard Place: Euclidean TSP in the Presence of Polygonal Obstacles Jeff Abrahamson Advisor: Ali Shokoufandeh, Ph.D. I give an O(nm+nm+m logm) time and O(n+m) space algorithm for finding the shortest traveling salesman tour through the vertices of two simple polygonal obstacles in the Euclidean plane, where n and m are the number of vertices of the two polygons.
متن کاملCoresets of obstacles in approximating Euclidean shortest path amid convex obstacles
Given a set P of non-intersecting polygonal obstacles in R defined with n vertices, we compute a sketch Ω of P whose size is independent of n. We utilize Ω to devise an algorithm to compute a (1 + )-approximate Euclidean shortest path between two points given with the description of P. When P comprises of convex polygonal obstacles, we devise a (2 + )approximation algorithm to efficiently answe...
متن کاملEuclidean TSP on two polygons
We give an O(nm+ nm +m logm) time and O(n +m) space algorithm for finding the shortest traveling salesman tour through the vertices of two simple polygonal obstacles in the Euclidean plane, where n and m are the number of vertices of the two polygons.
متن کاملThe perception of minimal structures: performance on open and closed versions of visually presented Euclidean travelling salesperson problems.
The planar Euclidean version of the travelling salesperson problem (TSP) requires finding a tour of minimal length through a two-dimensional set of nodes. Despite the computational intractability of the TSP, people can produce rapid, near-optimal solutions to visually presented versions of such problems. To explain this, MacGregor et al (1999, Perception 28 1417-1428) have suggested that people...
متن کاملChaotic n-Dimensional Euclidean and Hyperbolic Open Billiards and Chaotic Spinning Planar Billiards
We propose a new method to handle the n-dimensional billiard problem in the exterior of a finite mutually disjoint union of convex (but not necessarily strictly convex) smooth obstacles without eclipse in the Euclidean or hyperbolic n-space, and we prove that there exist trajectories visiting the obstacles in any given doubly infinite prescribed order (with the obvious restriction of no consecu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 95 شماره
صفحات -
تاریخ انتشار 2005